1859C - Another Permutation Problem - CodeForces Solution

#include <iostream>
#include <map>
#include <vector>
using namespace std;
typedef long long ll;

int main()
{
    int t;
    cin >> t;
    
    while(t--)
    {
        ll n;
        cin >> n;
        
        ll m = 0;
        
        for(ll i=0;i<n;i++)
        {
            ll ans = 0, k = 0;
            ll p = n;
            
            for(ll j=i;j<n;j++)
            ans += p*(j + 1) ,k = max(k ,p*(j + 1)) ,p--;
            
            for(ll j=i-1;j>=0;j--)
            ans += p * (j + 1) ,k = max(k ,p*(j + 1)) ,p--;
            
            m = max(m ,ans - k);
        }
        
        cout << m << '\n';
        
    }
}